Diffusion Models for Double-Ended Queues with Renewal Arrival Processes
نویسندگان
چکیده
منابع مشابه
Markovian Queues with Correlated Arrival Processes
In an attempt to examine the effect of dependencies in the arrival process on the steady state queue length process in single server queueing models with exponential service time distribution, four different models for the arrival process, each with marginally distributed exponential interarrivals to the queueing system, are considered. Two of these models are based upon the upper and lower bou...
متن کاملA Collector’s Problem with Renewal Arrival Processes
We study a collector’s problem withK renewal arrival processes for different type items, where the objective is to collect complete sets. In particular, we derive the asymptotic distribution of the sequence of interarrival times between set completions.
متن کاملHeavy-traffic limits for queues with periodic arrival processes
We establish conventional heavy-traffic limits for the number of customers in a Gt/GI/s queue with a periodic arrival process. We assume that the arrival counting process can be represented as the composition of a cumulative stochastic process that satisfies an FCLT and a deterministic cumulative rate function that is the integral of a periodic function. We establish three different heavy-traff...
متن کاملTransforming Renewal Processes for Simulation of Nonstationary Arrival Processes
Simulation models of real-life systems often assume stationary (homogeneous) Poisson arrivals. Therefore, when nonstationary arrival processes are required it is natural to assume Poisson arrivals with a time-varying arrival rate. For many systems, however, this provides an inaccurate representation of the arrival process which is either more or less variable than Poisson. In this paper we exte...
متن کاملThe Deap-A Double-Ended Heap to Implement Double-Ended Priority Queues
A priority queue is a data type where the element with the smallest key value can be found and deleted, and new elements can be inserted. It is also called a priority queue when the element with the largest key value is wanted, instead of the smallest. In some cases, it is interesting to find and delete both the smallest and the largest element, as well as to be able to insert new elements. A s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Systems
سال: 2015
ISSN: 1946-5238,1946-5238
DOI: 10.1287/13-ssy113